The Complete Extensions do not form a Complete Semilattice
نویسنده
چکیده
In his seminal paper that inaugurated abstract argumentation, Dung proved that the set of complete extensions forms a complete semilattice with respect to set inclusion. In this note we demonstrate that this proof is incorrect with counterexamples. We then trace the error in the proof and explain why it arose. We then examine the implications for the grounded extension.
منابع مشابه
Some Properties of Ideal Extensions in Ternary Semigroups
A concept of ideal extensions in ternary semigroups is introduced and throughly investigated. The connection between an ideal extensions and semilattice congruences in ternary semigroups is considered.
متن کاملCanonical Extensions and Profinite Completions of Semilattices and Lattices
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence and uniqueness theorems for these have been extended to general posets. This paper focuses on the intermediate class S∧ of (unital) meet semilattices. Any S ∈ S∧ embeds into the algebraic closure system Filt(Filt(S)). This iterated filter completion, denoted Filt(S), is a compact and ∨∧ -dense exte...
متن کاملOne-point extensions of locally compact paracompact spaces
A space $Y$ is called an {em extension} of a space $X$, if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {em equivalent}, if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence classes of) extensions $Y$ and $Y'$ of $X$ let $Yleq Y'$, if there is a continuous function of $Y'$ into $Y$ which fixes $X$ point-wise. An extension $Y$ ...
متن کاملSOME INTUITIONISTIC FUZZY CONGRUENCES
First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...
متن کاملStrong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numbering to be reduced into corresponding indices of the other numbering. The degrees of partial numberings of a given set with respect to this relation form an upper semilattice. In addition, Ershov’s completion constructio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.05341 شماره
صفحات -
تاریخ انتشار 2017